Continuous versus measurable recourse in N-stage stochastic programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SPAR: stochastic programming with adversarial recourse

We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the modeling of our adversarial phase. © 2005 Elsevier B.V. All rights reserved.

متن کامل

Restricted-Recourse Bounds for Stochastic Linear Programming

We consider the problem of bounding the expected value of a linear program (LP) containing random coe&cients, with applications to solving two-stage stochastic programs. An upper bound for minimizations is derived from a restriction of an equivalent, penalty-based formulation of the primal stochastic LP, and a lower bound is obtained from a restriction of a reformulation of the dual. Our “restr...

متن کامل

Stochastic Programming Problem with Fixed Charge Recourse

In this paper, we introduce a class of stochastic programming problem with fixed charge recourse in which a fixed cost is imposed if the value of the continuous recourse variable is strictly positive. The algorithm of a branch-and-cut method to solve the problem is developed by using the property of the expected recourse function. Then, the problem is applied to a power generating system. The n...

متن کامل

Stochastic Programming with Simple Integer Recourse

Stochastic integer programs are notoriously difficult. Very few properties are known and solution algorithms are very scarce. In this paper, we introduce the class of stochastic programs with simple integer recourse, a natural extension of the simple recourse case extensively studied in stochastic continuous programs. Analytical as well as computational properties of the expected recourse funct...

متن کامل

Stochastic Programming Recourse Models for Reconfigurable

 Inventory space requirements in remanufacturing facilities can vary significantly over time and by type of space needed due to variability in recaptured component quality, availability of refurbished components, remanufactured product demand, and returned product rates. Multi-period stochastic programming recourse models are developed to identify optimal adaptive schedules for internal, exter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1974

ISSN: 0022-247X

DOI: 10.1016/0022-247x(74)90157-7